bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
↳ QTRS
↳ DependencyPairsProof
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
BIN(s(x), s(y)) → BIN(x, y)
Used ordering: Polynomial interpretation [25,35]:
BIN(s(x), s(y)) → BIN(x, s(y))
The value of delta used in the strict ordering is 1/8.
POL(s(x1)) = 1/4 + (4)x_1
POL(BIN(x1, x2)) = (1/2)x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
BIN(s(x), s(y)) → BIN(x, s(y))
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
BIN(s(x), s(y)) → BIN(x, s(y))
The value of delta used in the strict ordering is 1/16.
POL(s(x1)) = 1/4 + (2)x_1
POL(BIN(x1, x2)) = (1/4)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))